Linear-Graph GP - A New GP Structure
نویسندگان
چکیده
In recent years different genetic programming (GP) structures have emerged. Today, the basic forms of representation for genetic programs are tree, linear and graph structures. In this contribution we introduce a new kind of GP structure which we call linear-graph. This is a further development to the linear-tree structure that we developed earlier. We describe the linear-graph structure, as well as crossover and mutation for this new GP structure in detail. We compare linear-graph programs with linear and tree programs by analyzing their structure and results on different test problems.
منابع مشابه
Linear-Tree GP and Its Comparison with Other GP Structures
In recent years different genetic programming (GP) structures have emerged. Today, the basic forms of representation for genetic programs are tree, linear and graph structures. In this contribution we introduce a new kind of GP structure which we call Linear-tree. We describe the linear-tree-structure, as well as crossover and mutation for this new GP structure in detail. We compare linear-tree...
متن کاملSemide nite programming relaxations for the graph partitioning problem (
A new semide nite programming, SDP, relaxation for the general graph partitioning problem, GP, is derived. The relaxation arises from the dual of the (homogenized) Lagrangian dual of an appropriate quadratic representation of GP. The quadratic representation includes a representation of the 0,1 constraints in GP. The special structure of the relaxation is exploited in order to project onto the ...
متن کاملOn a generalization of condition (PWP)
There is a flatness property of acts over monoids called Condition $(PWP)$ which, so far, has received much attention. In this paper, we introduce Condition GP-$(P)$, which is a generalization of Condition $(PWP)$. Firstly, some characterizations of monoids by Condition GP-$(P)$ of their (cyclic, Rees factor) acts are given, and many known results are generalized. More...
متن کاملEvaluation and selection of sustainable suppliers in supply chain using new GP-DEA model with imprecise data
Nowadays, with respect to knowledge growth about enterprise sustainability, sustainable supplier selection is considered a vital factor in sustainable supply chain management. On the other hand, usually in real problems, the data are imprecise. One method that is helpful for the evaluation and selection of the sustainable supplier and has the ability to use a variety of data types is data envel...
متن کاملLinear Time Approximation Algorithm for Multicoloring Lattice Graphs with Diagonals
Let P be a subset of 2-dimensional integer lattice points P = {1, 2, . . . , m}× {1, 2, . . . , n} ⊆ Z. We consider the graph GP with vertex set P satisfying that two vertices in P are adjacent if and only if Euclidean distance between the pair is less than or equal to √ 2. Given a non-negative vertex weight vector w ∈ Z+, a multicoloring of (GP , w) is an assignment of colors to P such that ea...
متن کامل